Decomposing recurrent states of the abelian sandpile model

نویسندگان

  • Mark Dukes
  • Thomas Selig
چکیده

The recurrent states of the Abelian sandpile model (ASM) are those states that appear infinitely often. For this reason they occupy a central position in ASM research. We present several new results for classifying recurrent states of the Abelian sandpile model on graphs that may be decomposed in a variety of ways. These results allow us to classify, for certain families of graphs, recurrent states in terms of the recurrent states of its components. We use these decompositions to give recurrence relations for the generating functions of the level statistic on the recurrent configurations. We also interpret our results with respect to the sandpile group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An NP-complete Problem for the Abelian Sandpile Model

A configuration of the Abelian sandpile model is called recurrent if grains of sand can be added to it so that the resulting configuration relaxes to the original one; else it is called transient. Given a transient configuration, a recurrent configuration results after adding enough grains of sand. In the case of a three-dimensional sandpile model, it is shown in this paper that the problem of ...

متن کامل

Abelian networks III. The critical group

The critical group of an abelian network is a finite abelian group that governs the behavior of the network on large inputs. It generalizes the sandpile group of a graph. We show that the critical group of an irreducible abelian network acts freely and transitively on recurrent states of the network. We exhibit the critical group as a quotient of a free abelian group by a subgroup containing th...

متن کامل

Asymmetric Abelian Sandpile Models

In the Abelian sandpile models introduced by Dhar, long-time behavior is determined by an invariant measure supported uniformly on a set of implicitly defined recurrent configurations of the system. Dhar proposed a simple procedure, the burning algorithm, as a possible test of whether a configuration is recurrent, and later with Majumdar verified the correctness of this test when the toppling r...

متن کامل

A Bijection Between the Recurrent Configurations of a Hereditary Chip-Firing Model and Spanning Trees

Hereditary chip-firing models generalize the Abelian sandpile model and the cluster firing model to an exponential family of games induced by covers of the vertex set. This generalization retains some desirable properties, e.g. stabilization is independent of firings chosen and each chip-firing equivalence class contains a unique recurrent configuration. In this paper we present an explicit bij...

متن کامل

Concrete and abstract structure of the sandpile group for thick trees with loops

We answer a question of László Babai concerning the abelian sandpile model. Given a graph, the model yields a finite abelian group of recurrent configurations which is closely related to the combinatorial Laplacian of the graph. We explicitly describe the group elements and operations in the case of thick trees with loops—that is, graphs which are obtained from trees by setting arbitrary edge m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2016